Aggregative Games with Entry1

نویسندگان

  • Simon P. Anderson
  • Nisvan Erkal
  • Daniel Piccinin
چکیده

Aggregative games are used to model strategic interaction in many …elds of economics, including industrial organization, political economy, international trade, and public …nance. In such games, each player’s payo¤ depends on his/her own actions and an aggregate of all player’s actions. Examples in industrial organization are the Cournot oligopoly model, logit and CES di¤erentiated products Bertrand models (and linear demand models in the short run), and R&D games. We suppose a change a¤ects some of the players, such as cost shocks (subsidies, tari¤s), privatization, and a merger or RJV. In a unifying framework, we determine the impact of the change on the aggregate variable, producer surplus and consumer surplus under free entry. We also show that the IIA property of demands implies that consumer surplus depends on the aggregate alone, and the corresponding Bertrand pricing game is aggregative. JEL Classi…cations: D43, L13

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Aggregate comparative statics

In aggregative games, each player’s payoff depends on her own actions and an aggregate of the actions of all the players (for example, sum, product or some moment of the distribution of actions). Many common games in industrial organization, political economy, public economics, and macroeconomics can be cast as aggregative games. In most of these situations, the behavior of the aggregate is of ...

متن کامل

Projected-gradient algorithms for generalized equilibrium seeking in Aggregative Games are preconditioned Forward-Backward methods

We show that projected-gradient methods for the distributed computation of generalized Nash equilibria in aggregative games are preconditioned forward-backward splitting methods applied to the KKT operator of the game. Specifically, we adopt the preconditioned forward-backward design, recently conceived by Yi and Pavel in the manuscript “A distributed primal-dual algorithm for computation of ge...

متن کامل

Local Aggregative Games

Aggregative games provide a rich abstraction to model strategic multi-agent interactions. We introduce local aggregative games, where the payoff of each player is a function of its own action and the aggregate behavior of its neighbors in a connected digraph. We show the existence of pure strategy -Nash equilibrium in such games when the payoff functions are convex or sub-modular. We prove an i...

متن کامل

Aggregative Games and Best-Reply Potentials

This paper introduces quasi-aggregative games and establishes conditions under which such games admit a best-reply potential. This implies existence of a pure strategy Nash equilibrium without any convexity or quasi-concavity assumptions. It also implies convergence of best-reply dynamics under some additional assumptions. Most of the existing literature’s aggregation concepts are special cases...

متن کامل

Aggregate Comparative

In aggregative games, each player's payoff depends on her own actions and an aggregate of the actions of all the players (for example, sum, product or some moment of the distribution of actions). Many common games in industrial organization, political economy, public economics, and macroeconomics can be cast as aggregative games. In most of these situations, the behavior of the aggregate is of ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2010